#include<stdio.h>
int uniquePaths(int m, int n) {
    int i, j;
    int x = 0;
    int y = 0;
    int dp[101][101] = { 0 };
    dp[1][1] = 1;
    for (i = 1; i <= m; i++) {
        for (j = 1; j <= n; j++) {
            if (i == 1 && j == 1) continue;
            if (i == 1) {
                dp[i][j] = dp[i][j - 1];
                continue;
            }
            if (j == 1) {
                dp[i][j] = dp[i - 1][j];
                continue;
            }
            dp[i][j] = dp[i - 1][j] + dp[i][j - 1];
        }
    }
    return dp[m][n];
}